Literal-Matching-Biased Link Analysis
نویسندگان
چکیده
Web link analysis has been proven to provide significant enhancement to the precision of web search in practice. The PageRank algorithm, used in the Google Search Engine, plays an important role in improving the quality of results by employing an explicit hyperlink structure among the Web pages. The prestige of Web pages defined by PageRank is derived solely from surfers’ random walk on the Web Graph without any textual content consideration. However, in the practical sense, user surfing behavior is far from random jumping. In this paper, we propose a link analysis that takes the textual information of Web pages into account. The result shows that our proposed ranking algorithms perform better than the original PageRank.
منابع مشابه
Conventionalization of Lexical Meanings and the Role of Metaphoricity: Processing of Metaphorical Polysemy Using a Cross-modal Lexical Priming Task*
Decades of lexical ambiguity research has rigorously studied effects of relative sense frequency on sense disambiguation in biased contexts, while fundamental semantic issues such as distinction of different types of ambiguities, or influences from lexical meanings’ semantic nature (e.g., literal or metaphorical) as well as these meanings’ degrees of conventionalization, have received less atte...
متن کاملTime Course of Metaphor Comprehension in the Visual World
To investigate the real time processing of metaphoric adjectives, we measured participants looking behavior as they listened to sentences such as The little boy was shocked as a result of the [electrical socket/report card] in the context of a display with four images. Displays included two Unrelated pictures, a Literal picture consistent with the literal interpretation of the adjective (an ele...
متن کاملA unified probabilistic generative framework for extractive spoken document summarization
In this paper, we consider extractive summarization of Chinese broadcast news speech. A unified probabilistic generative framework that combined the sentence generative probability and the sentence prior probability for sentence ranking was proposed. Each sentence of a spoken document to be summarized was treated as a probabilistic generative model for predicting the document. Two different mat...
متن کاملResults of NBJLM for OAEI 2010
This paper presents the results obtained by NBJLM (Nankai Baidu Joint Lab Matcher) for its first participation to OAEI 2010. The research of ontology-based similarity calculation among concepts has already been a hot issue. NBJLM is an hybrid ontology alignment method that considers both similarity of literal concept and semantic structure. Simultaneously, how to accelerate matching has been me...
متن کاملLiteral Shuffle of Compressed Words
Straight-Line Programs (SLP) are widely used compressed representations of words. In this work we study the rational transformations and the literal shuffle of words compressed via SLP, proving that the first preserves the compression rate, while the second does not. As a consequence, we prove a tight bound for the descriptional complexity of 2D texts compressed via SLP. Finally, we observe tha...
متن کامل